scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga and ica are proposed to solve the generated problems. the performances of algorithms are evaluated by computational time and relative percentage deviation (rpd) factors. the results indicate that ica solves the problems faster than other algorithms and the hybrid algorithm produced best solution based on rpd.